Efficient designs for constrained mixture experiments
نویسندگان
چکیده
Many practical experiments on mixtures (where the components sum to one) include additional lower or upper bounds on components, or on linear combinations of them. Usually theory cannot be used to obtain a good design, and algorithmic methods are necessary. Some of the available methods are discussed. Their performance is evaluated on some examples, and the form of the optimal design is investigated.
منابع مشابه
Using a Genetic Algorithm to Generate D-optimal Designs for Mixture Experiments
We propose and develop a genetic algorithm (GA) for generating D-optimal designs where the experimental region is an irregularly shaped polyhedral region. Our approach does not require selection of points from a user-defined candidate set of mixtures and allows movement through a continuous region that includes highly constrained mixture regions. This approach is useful in situations where extr...
متن کاملShrinkage simplex-centroid designs for a quadratic mixture model
A simplex-centroid design for q mixture components comprises of all possible subsets of the q components, present in equal proportions. The design does not contain full mixture blends except the overall centroid. In real-life situations, all mixture blends comprise of at least a minimum proportion of each component. Here, we introduce simplex-centroid designs which contain complete blend...
متن کاملAn Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm
In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...
متن کاملParticle Swarm Optimization Techniques for Finding Optimal Mixture Designs
Particle Swarm Optimization (PSO) is a meta-heuristic algorithm that has been shown to be successful in finding the optimum solution or close to the optimum for a wide variety of real and complicated optimization problems in engineering and computer science. This paper adapts PSO methodology by first solving an optimization problem on the hypercube and then projecting the solution onto the q-si...
متن کاملEfficient Large Numbers Karatsuba-Ofman Multiplier Designs for Embedded Systems
Long number multiplications (n ≥ 128-bit) are a primitive in most cryptosystems. They can be performed better by using Karatsuba-Ofman technique. This algorithm is easy to parallelize on workstation network and on distributed memory, and it’s known as the practical method of choice. Multiplying long numbers using Karatsuba-Ofman algorithm is fast but is highly recursive. In this paper, we propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Statistics and Computing
دوره 9 شماره
صفحات -
تاریخ انتشار 1999